More Practical Fully Homomorphic Encryption

Towards practical fully homomorphic encryption

Practical Applications of Homomorphic Encryption

Homomorphic cryptography has been one of the most interesting topics of mathematics and computer security since Gentry presented the first construction of a fully homomorphic encryption (FHE) scheme in 2009. Since then, a number of different schemes have been found, that follow the approach of bootstrapping a fully homomorphic scheme from a somewhat homomorphic foundation. All existing implemen...

Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes

Outsourced computations enable more efficient solutions towards practical problems that require major computations. Nevertheless, users’ privacy remains as a major challenge, as the service provider can access users’ data freely. It has been shown that fully homomorphic encryption schemes might be the perfect solution, as it allows one party to process users’ data homomorphically, without the n...

On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers

The notion of fully homomorphic encryption is very important since it enables many important applications, such as the cloud computing scenario. In EUROCRYPT 2010, van Dijk, Gentry, Halevi and Vaikuntanathan proposed an interesting fully homomorphic encryption scheme based on a somewhat homomorphic encryption scheme using integers. In this paper, we demonstrate a very practical CCA-1 attack aga...

A Roadmap to Fully Homomorphic Elections: Stronger Security, Better Verifiability

After the trials of remote internet voting for local elections in 2011 and parliamentary elections in 2013, a number of local referendums has renewed interest in internet voting in Norway. The voting scheme used in Norway is not quantum-safe and it has limited voter verifiability. In this case study, we consider how we can use fully homomorphic encryption to construct a quantum-safe voting sche...